Message Passing with Maple

نویسنده

  • Justin M. J. Wozniak
چکیده

In this report we document a software package under development to allow message passing in the MPI model using the computer algebra system Maple. The new software, called maplle, consists of two components, a set of Maple functions and a MPI/C driver. The maplle system allows the user to easily parallelize Maple algorithms and use message passing functionality familiar to MPI users in a Maple format.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Maple on the Intel Paragon

We ported the computer algebra system Maple V to the Intel Paragon, a massively parallel, distributed memory machine. In order to take advantage of the parallel architecture, we extended the Maple kernel with a set of message passing primitives based on the Paragon's native message passing library. Using these primitives, we implemented a parallel version of Karatsuba multiplication for univari...

متن کامل

Automated Performance Prediction for ScalableParallel Computing yMark

Performance prediction is necessary in order to deal with multi-dimensional performance eeects on parallel systems. The compiler-generated analytical model developed in this paper accounts for the eeects of cache behavior, CPU execution time and message passing overhead for real programs written in high level data-parallel languages. The performance prediction technique is shown to be eeective ...

متن کامل

Dynamic Performance Prediction for Scalable Parallel Computing

Performance prediction is necessary in order to deal with multi-dimensional performance eeects on parallel systems. The compiler-generated analytical model developed in this paper accounts for the eeects of cache behavior, CPU execution time and message passing overhead for real programs written in high level data-parallel languages. The performance prediction technique is shown to be eeective ...

متن کامل

A Message-Passing Distributed Memory Parallel Algorithm for a Dual-Code Thin Layer, Parabolized Navier-Stokes Solver

In this study, the results of parallelization of a 3-D dual code (Thin Layer, Parabolized Navier-Stokes solver) for solving supersonic turbulent flow around body and wing-body combinations are presented. As a serial code, TLNS solver is very time consuming and takes a large part of memory due to the iterative and lengthy computations. Also for complicated geometries, an exceeding number of grid...

متن کامل

An Improved Token-Based and Starvation Free Distributed Mutual Exclusion Algorithm

Distributed mutual exclusion is a fundamental problem of distributed systems that coordinates the access to critical shared resources. It concerns with how the various distributed processes access to the shared resources in a mutually exclusive manner. This paper presents fully distributed improved token based mutual exclusion algorithm for distributed system. In this algorithm, a process which...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003